Cryptanalysis and Design of Block Ciphers
ثبت نشده
چکیده
This thesis focuses on cryptanalysis techniques and design of block ciphers. In particular, modern analysis methods such as square, boomerang, impossible differential and linear attacks are described and applied to real block ciphers. The first part of this thesis concentrates on the two most relevant modern cryptanalysis techniques: linear and differential cryptanalysis. These and related techniques have been applied to SAFER K/SK/+/++, IDEA, Hierocrypt3, Hierocrypt-L1, Skipjack and the PES ciphers. In many attacks, the interaction between the block cipher and its key schedule algorithm was exploited, so that the complexity of key-recovery attacks could be reduced. These analyses often led to the discovery of weak keys, namely, key values for which the attack complexity was comparatively lower than for a random key. In some cases, the existence of weak keys, derived from the original key schedule, and holding for the whole cipher, might suggest a need for a redesign of the key setup algorithm. The second part of this thesis describes and analyzes new block ciphers, called MESH, which were designed with the same group operations as the IDEA block cipher. Three designs are presented: MESH-64, MESH-96, and MESH128. Their novel features include: (i) flexible block sizes (in increments of 32 bits), (ii) larger round functions (MA-boxes) compared to IDEA, (iii) distinct key-mixing layers for odd and even rounds, and (iv) new key schedule algorithms that achieve fast key avalanche. Estimates for the software performance of MESH ciphers indicate better or comparable speed to that of triple-DES. A preliminary security evaluation of these three ciphers included truncated and impossible differentials, linear, square, slide and advanced-slide, multiplicative differentials (on simplified versions), and Demirci’s attacks, among others. The initial results of these attacks seem to indicate that the MESH ciphers present a relatively large margin of security against modern cryptanalysis techniques. Other cipher designs are further suggested, based on the flexible MA-boxes, and on the alternative AM-boxes.
منابع مشابه
A new method for accelerating impossible differential cryptanalysis and its application on LBlock
Impossible differential cryptanalysis, the extension of differential cryptanalysis, is one of the most efficient attacks against block ciphers. This cryptanalysis method has been applied to most of the block ciphers and has shown significant results. Using structures, key schedule considerations, early abort, and pre-computation are some common methods to reduce complexities of this attack. In ...
متن کاملImpossible Differential Cryptanalysis of Reduced-Round Midori64 Block Cipher (Extended Version)
Impossible differential attack is a well-known mean to examine robustness of block ciphers. Using impossible differ- ential cryptanalysis, we analyze security of a family of lightweight block ciphers, named Midori, that are designed considering low energy consumption. Midori state size can be either 64 bits for Midori64 or 128 bits for Midori128; however, both vers...
متن کاملBiclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity
In the biclique attack, a shorter biclique usually results in less data complexity, but at the expense of more computational complexity. The early abort technique can be used in partial matching part of the biclique attack in order to slightly reduce the computations. In this paper, we make use of this technique, but instead of slight improvement in the computational complexity, we keep the amo...
متن کاملBlock Ciphers And Cryptanalysis
This report gives a basic introduction to block cipher design and analysis. The concepts and design principles of block ciphers are explained, particularly the class of block ciphers known as Feistel ciphers. Some modern block cipher cryptanalysis methods are demonstrated by applying them to variants of a weak Feistel cipher called Simplified TEA (STEA), which is based on the Tiny Encryption Al...
متن کاملCryptographic Functions and Design Criteria for Block Ciphers
Most last-round attacks on iterated block ciphers provide some design criteria for the round function. Here, we focus on the links between the underlying properties. Most notably, we investigate the relations between the functions which oppose a high resistance to linear cryptanalysis and to differential cryptanalysis.
متن کاملChaos and Cryptography: Block Encryption Ciphers Based on Chaotic Maps
This paper is devoted to the analysis of the impact of chaos-based techniques on block encryption ciphers. We present several chaos based ciphers. Using the well-known principles in the cryptanalysis we show that these ciphers do not behave worse than the standard ones, opening in this way a novel approach to the design of block encryption ciphers.
متن کامل